The hydrogen identity for Laplacians
نویسنده
چکیده
For any 1-dimensional simplicial complex G defined by a finite simple graph, the hydrogen identity |H| = L−L−1 holds, where |H| = (|d| + |d|∗)2 is the sign-less Hodge Laplacian defined by the sign-less incidence matrix |d| and where L is the connection Laplacian. Having linked the Laplacian spectral radius ρ of G with the spectral radius of the adjacency matrix its connection graph G′ allows for every k to estimate ρ ≤ rk − 1/rk, where rk = 1 + (P (k)) 1/k and P (k) = maxxP (k, x), where P (k, x) is the number of paths of length k starting at a vertex x in G′. The limit rk − 1/rk for k → ∞ is the spectral radius ρ of |H| which by Wielandt is an upper bound for the spectral radius ρ of H = (d + d∗)2, with equality if G is bipartite. We can relate so the growth rate of the random walks in the line graph GL of G with the one in the connection graph G′ of G. The hydrogen identity implies that the random walk ψ(n) = Lψ on the connection graphG′ with integer n solves the 1-dimensional Jacobi equation ∆ψ = |H|ψ with ∆u(n) = u(n+ 2)− 2u(n) + u(n− 2) and assures that every solution is represented by such a reversible path integral. The hydrogen identity also holds over any finite field F . There, the dynamics Lψ with n ∈ Z is a reversible cellular automaton with alphabet F. By taking products of simplicial complexes, such processes can be defined over any lattice Z. Since L and L−2 are isospectral, by a theorem of Kirby, L is always similar to a symplectic matrix if the graph has an even number of simplices. By the implicit function theorem, the hydrogen relation is robust in the following sense: any matrix K with the same support than |H| can still be written as K = L − L−1 with a connection Laplacian satisfying L(x, y) = L−1(x, y) = 0 if x ∩ y = ∅.
منابع مشابه
IRWIN AND JOAN JACOBS CENTER FOR COMMUNICATION AND INFORMATION TECHNOLOGIES Generalized Laplacians and Curvatures for Image Analysis and Processing
Newly developed combinatorial Laplacians and curvature operators for grayscale, as well as color images are tested on 2D synthetic and natural images. This novel approach is based upon more general concepts developed by R. Forman and is inspired by the Bochner-Weitzeböck formula which is an essential identity in Riemannian Geometry. After the presentation of the operators as they operate on ima...
متن کاملLocal Integration by Parts and Pohozaev Identities for Higher Order Fractional Laplacians
We establish an integration by parts formula in bounded domains for the higher order fractional Laplacian (−∆) with s > 1. We also obtain the Pohozaev identity for this operator. Both identities involve local boundary terms, and they extend the identities obtained by the authors in the case s ∈ (0, 1). As an immediate consequence of these results, we obtain a unique continuation property for th...
متن کاملOn Spectral Properties of Witten-laplacians, Their Range Projections and Brascamp{lieb's Inequality
A study is made of an integral identity introduced recently by B. Heller and J. Sjj ostrand; in comparison with the Brascamp{Lieb inequality it is a more exible and in some contexts stronger means for the analysis of correlation asymptotics in statistical mechanics. Using functional analysis, viz. a detailed version of the Closed Range Theorem, the identity's validity is shown to depend upon an...
متن کاملHigh-Ordered Random Walks and Generalized Laplacians on Hypergraphs
Despite of the extreme success of the spectral graph theory, there are relatively few papers applying spectral analysis to hypergraphs. Chung first introduced Laplacians for regular hypergraphs and showed some useful applications. Other researchers treated hypergraphs as weighted graphs and then studied the Laplacians of the corresponding weighted graphs. In this paper, we aim to unify these ve...
متن کاملA Combinatorial View of Graph Laplacians
Discussions about different graph Laplacians—mainly the normalized and unnormalized versions of graph Laplacian—have been ardent with respect to various methods of clustering and graph based semi-supervised learning. Previous research in the graph Laplacians, from a continuous perspective, investigated the convergence properties of the Laplacian operators on Riemannian Manifolds. In this paper,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2018